Cost allocation in shortest path games

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Cost allocation in shortest path games

A class of cooperative games arising from shortest path problems is deened. These shortest path games are shown to be totally balanced and allow a population-monotonic allocation scheme. Possible methods for obtaining core elements are indicated; rst, by relating to the allocation rules in taxation and bankruptcy problems, second, by constructing an explicit rule that takes opportunity costs in...

متن کامل

Stochastic Shortest Path Games

We consider dynamic, two-player, zero-sum games where the \minimizing" player seeks to drive an underlying nite-state dynamic system to a special terminal state along a least expected cost path. The \maximizer" seeks to interfere with the minimizer's progress so as to maximize the expected total cost. We consider, for the rst time, undiscounted nite-state problems, with compact action spaces, a...

متن کامل

Stochastic Shortest Path Games and Q-Learning

We consider a class of two-player zero-sum stochastic games with finite state and compact control spaces, which we call stochastic shortest path (SSP) games. They are total cost stochastic dynamic games that have a cost-free termination state. Based on their close connection to singleplayer SSP problems, we introduce model conditions that characterize a general subclass of these games that have...

متن کامل

Optimal Allocation of Protective Resources in Shortest-Path Networks

T article introduces a game-theoretic approach for allocating protection resources among the components of a network so as to maximize its robustness to external disruptions. Specifically, we consider shortestpath networks where disruptions may result in traffic flow delays through the affected components or even in the complete loss of some elements. A multilevel program is proposed to identif...

متن کامل

Cost Allocation in Partition Function Form Games

A cooperative game in partition function form is proposed for a cost allocation problem. The game describes a real situation in which a payoff of any coalition does not only depend on the players in the coalition but also on the coalition structure of the other players. Solution concepts like the stable set and the core are analyzed. Relations of the concepts in the case of the game in partitio...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Mathematical Methods of Operations Research (ZOR)

سال: 2002

ISSN: 1432-2994,1432-5217

DOI: 10.1007/s001860200222